Analyzing relevance vector machines using a single penalty approach

نویسندگان

چکیده

Relevance vector machine (RVM) is a popular sparse Bayesian learning model typically used for prediction. Recently it has been shown that improper priors assumed on multiple penalty parameters in RVM may lead to an posterior. Currently the literature, sufficient conditions posterior propriety of do not allow over parameters. In this article, we propose single relevance (SPRVM) which are replaced by and consider semi-Bayesian approach fitting SPRVM. The necessary SPRVM more liberal than those several parameter. Additionally, also prove geometric ergodicity Gibbs sampler analyze hence can estimate asymptotic standard errors associated with Monte Carlo means predictive distribution. Such error cannot be computed case RVM, since rate convergence known. performance compared analyzing two simulation examples three real life datasets.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relevance Feedback using Support Vector Machines

Harris Drucker [email protected] AT&T Research and Monmouth University, West Long Branch, NJ 07764, USA Behzad Shahrary [email protected] David C. Gibbon [email protected] AT&T Research, 200 Laurel Ave., Middletown, NJ, 07748, USA. Correspondence should be addressed to: Dr. Harris Drucker Monmouth University West Long Branch, NJ 07764 phone: 732-571-3698 email: [email protected] ...

متن کامل

Variational Relevance Vector Machines

The Support Vector Machine (SVM) of Vapnik [9] has become widely established as one of the leading approaches to pattern recognition and machine learning. It expresses predictions in terms of a linear combination of kernel functions centred on a subset of the training data, known as support vectors. Despite its widespread success, the SVM suffers from some important limitations, one of the most...

متن کامل

Gene selection using support vector machines with non-convex penalty

MOTIVATION With the development of DNA microarray technology, scientists can now measure the expression levels of thousands of genes simultaneously in one single experiment. One current difficulty in interpreting microarray data comes from their innate nature of 'high-dimensional low sample size'. Therefore, robust and accurate gene selection methods are required to identify differentially expr...

متن کامل

Support vector machines with adaptive Lq penalty

The standard Support Vector Machine (SVM) minimizes the hinge loss function subject to the L2 penalty or the roughness penalty. Recently, the L1 SVM was suggested for variable selection by producing sparse solutions (Bradley and Mangasarian, 1998; Zhu et al., 2003). These learning methods are non-adaptive since their penalty forms are pre-determined before looking at data, and they often perfor...

متن کامل

STAGE-DISCHARGE MODELING USING SUPPORT VECTOR MACHINES

Establishment of rating curves are often required by the hydrologists for flow estimates in the streams, rivers etc. Measurement of discharge in a river is a time-consuming, expensive, and difficult process and the conventional approach of regression analysis of stage-discharge relation does not provide encouraging results especially during the floods. P

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistical Analysis and Data Mining

سال: 2021

ISSN: ['1932-1864', '1932-1872']

DOI: https://doi.org/10.1002/sam.11551